Achievable Rates for Pattern Recognition
نویسندگان
چکیده
منابع مشابه
Achievable Rates for Probabilistic Shaping
For a layered probabilistic shaping (PS) scheme with a general decoding metric, an achievable rate is derived using Gallager’s error exponent approach. Several instances for specific decoding metrics are discussed, including bit-metric decoding, interleaved coded modulation, and hard-decision decoding. It is shown that important previously known achievable rates can also be achieved by layered ...
متن کاملAchievable rates for multiple descriptions
Consider a sequence of independent identically distributed where I(.) denotes Shannon mutual information. These rates are shown to be optimal for deterministic distortion measures.
متن کاملAchievable Rates for Tomlinson-Harashima Precoding
This correspondence examines Tomlinson–Harashima precoding (THP) on discrete-time channels having intersymbol interference and additive white Gaussian noise. An exact expression for the maximum achievable information rate of zero-forcing (ZF) THP is derived as a function of the channel impulse response, the input power constraint, and the additive white Gaussian noise variance. Information rate...
متن کاملAchievable rates for the Gaussian quantum channel
We study the properties of quantum stabilizer codes that embed a finite-dimensional protected code space in an infinite-dimensional Hilbert space. The stabilizer group of such a code is associated with a symplectically integral lattice in the phase space of 2N canonical variables. From the existence of symplectically integral lattices with suitable properties, we infer a lower bound on the quan...
متن کاملAchievable Rates for Shaped Bit-Metric Decoding
A new achievable rate for bit-metric decoding (BMD) is derived using random coding arguments. The rate expression can be evaluated for any input distribution, and in particular the bit-levels of binary input labels can be stochastically dependent. Probabilistic shaping with dependent bit-levels (shaped BMD), shaping of independent bit-levels (bit-shaped BMD) and uniformly distributed independen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2008
ISSN: 0018-9448
DOI: 10.1109/tit.2007.911296